On small line sets with few odd-points
نویسنده
چکیده
In this paper, we study small sets of lines in PG(n, q) and AG(n, q), q odd, that have a small number of odd-points. We fix a small glitch in the proof of an earlier bound in the affine case, we extend the theorem to the projective case, and we attempt to classify all the sets where equality is reached. For the projective case, we obtain a full classification. For the affine case, we obtain a full classification minus one open case where there is only a characterization. MSC 2010 Classification: 05B25, 51E20
منابع مشابه
Phishing website detection using weighted feature line embedding
The aim of phishing is tracing the users' s private information without their permission by designing a new website which mimics the trusted website. The specialists of information technology do not agree on a unique definition for the discriminative features that characterizes the phishing websites. Therefore, the number of reliable training samples in phishing detection problems is limited. M...
متن کاملOn sets of odd type of PG(n, 4) and the universal embedding of the dual polar space DH(2n-1, 4)
A set of points of the projective space PG(n, 4), n ≥ 0, is said to be of odd type if it intersects each line in an odd number of points. The number of sets of odd type of PG(n, 4), n ≥ 0, is known to be equal to 2an where an = 13(n + 1)(n 2 + 2n + 3). In the present paper, we give an alternative more geometric proof of this property. The additional information revealed by this proof will allow...
متن کاملCameron-Liebler line classes
New examples of Cameron-Liebler line classes in PG(3,q) are given with parameter 1 2 (q 2− 1). These examples have been constructed for many odd values of q using a computer search, by forming a union of line orbits from a cyclic collineation group acting on the space. While there are many equivalent characterizations of these objects, perhaps the most significant is that a set of lines L in PG...
متن کاملAnalysis and Synthesis of Facial Expressions by Feature-Points Tracking and Deformable Model
Face expression recognition is useful for designing new interactive devices offering the possibility of new ways for human to interact with computer systems. In this paper we develop a facial expressions analysis and synthesis system. The analysis part of the system is based on the facial features extracted from facial feature points (FFP) in frontal image sequences. Selected facial feature poi...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 75 شماره
صفحات -
تاریخ انتشار 2015